package com.wx.leetcode;

/**
 * @description: 最富有客户的资产总量
 * @author: wx
 * @create: 2020-12-01 15:59
 **/
public class MaximumWealthTopic {

    public static int maximumWealth(int[][] accounts) {
        int max = 0;
        for (int[] account : accounts) {
            int temp = 0;
            for (int value : account) {
                temp += value;
            }
            max = Math.max(max,temp);
        }
        return max;
    }
    
    public static void main(String[] agrs){
        System.out.println(maximumWealth(new int[][]{{1,5},{7,3},{3,5}}));
    }

}
